深度学习模型已使高维功能MRI（fMRI）数据的分析能够跃升。然而，许多以前的方法对各种时间尺度的上下文表示次优敏感。在这里，我们提出了螺栓，这是一种血氧级依赖性变压器模型，用于分析多变量fMRI时间序列。螺栓利用了一系列具有新型融合窗户注意机制的变压器编码器。编码是在时间序列中在时间重叠的窗口上执行的，以捕获本地表示。为了暂时地集成信息，在每个窗口中的基本令牌和来自附近窗口的边缘令牌之间计算交叉窗口的注意力。要逐渐从本地表示，窗口重叠的程度以及边缘令牌的数量在整个级联反应中逐渐增加。最后，采用了一种新颖的跨窗口正则化来使整个时间序列之间的高级分类特征对齐。大规模公共数据集的全面实验证明了螺栓与最先进方法的出色性能。此外，解释性分析以确定具有里程碑意义的时间点和区域，这些时间点和区域最大程度地促进模型的决策证实了文献中突出的神经科学发现。

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

通过源至目标模态丢失图像的插图可以促进医学成像中的下游任务。合成目标图像的普遍方法涉及通过生成对抗网络（GAN）的单发映射。然而，隐式表征图像分布的GAN模型可能会受到样本保真度和多样性的有限。在这里，我们提出了一种基于对抗扩散建模Syndiff的新方法，以提高医学图像合成的可靠性。为了捕获图像分布的直接相关性，Syndiff利用条件扩散过程逐步将噪声和源图像映射到目标图像上。对于推断期间的快速准确图像采样，大扩散步骤与反向扩散方向的对抗投影结合在一起。为了对未配对的数据集进行培训，设计了一个循环一致的体系结构，并使用两个耦合的扩散过程，以合成给定源的目标和给定的目标。报告了有关联合竞争性GAN和扩散模型在多对比度MRI和MRI-CT翻译中的效用的广泛评估。我们的示威表明，Syndiff在定性和定量上都可以针对竞争基线提供出色的性能。

基于学习的MRI翻译涉及一个合成模型，该模型将源对比度映射到目标对比图像上。多机构合作是跨广泛数据集培训合​​成模型的关键，但是集中式培训涉及隐私风险。联合学习（FL）是一个协作框架，相反，采用分散培训，以避免共享成像数据并减轻隐私问题。但是，成像数据的分布中固有的异质性可能会损害训练的模型。一方面，即使对于具有固定源目标配置的常见翻译任务，图像分布的隐式变化也很明显。相反，当规定具有不同源目标配置的不同翻译任务时，在站点内和跨站点内会出现明确的变化。为了提高针对域转移的可靠性，我们在这里介绍了MRI合成的第一种个性化FL方法（PFLSYNTH）。 PFLSYNTH基于配备映射器的对抗模型，该映射器会产生特定于单个站点和源目标对比的潜伏期。它利用新颖的个性化阻滞了基于这些潜伏期的发电机跨发电机图的统计和加权。为了进一步促进位点特异性，在发电机的下游层上采用了部分模型聚集，而上游层则保留在本地。因此，PFLSYNTH可以培训统一的合成模型，该模型可以可靠地跨越多个站点和翻译任务。在多站点数据集上进行的全面实验清楚地证明了PFLSHNTH在多对比度MRI合成中对先前联合方法的增强性能。

深度MRI重建通常是使用有条件的模型进行的，该模型将其映射到完全采样的数据作为输出中。有条件的模型在加速成像运算符的知识下执行了脱氧，因此在操作员的域转移下，它们概括了很差。无条件模型是一种强大的替代方法，相反，它可以学习生成图像先验，以提高针对领域转移的可靠性。鉴于它们的高度代表性多样性和样本质量，最近的扩散模型特别有希望。然而，事先通过静态图像进行预测会导致次优性能。在这里，我们提出了一种基于适应性扩散的新型MRI重建Adadiff。为了启用有效的图像采样，引入了一个可以使用大扩散步骤的对抗映射器。使用受过训练的先验进行两阶段的重建：一个快速扩散阶段，产生初始重建阶段，以及一个适应阶段，其中更新扩散先验以最大程度地减少获得的K空间数据的重建损失。关于多对比的大脑MRI的演示清楚地表明，Adadiff在跨域任务中的竞争模型以及域内任务中的卓越或PAR性能方面取得了出色的性能。

筛选行李X射线扫描的筛选杂乱和闭塞违禁品，即使对于专家的安全人员而言，甚至是一个繁琐的任务。本文提出了一种新的策略，其扩展了传统的编码器 - 解码器架构，以执行实例感知分段，并在不使用任何附加子网络或对象检测器的情况下执行违反互斥项的合并实例。编码器 - 解码器网络首先执行传统的语义分割，并检索杂乱的行李物品。然后，该模型在训练期间逐步发展，以识别各个情况，使用显着减少的训练批次。为了避免灾难性的遗忘，一种新颖的客观函数通过保留先前获得的知识来最小化每次迭代中的网络损失，同时通过贝叶斯推断解决其复杂的结构依赖性。对我们两个公开的X射线数据集的框架进行了全面评估，表明它优于最先进的方法，特别是在挑战的杂乱场景中，同时在检测准确性和效率之间实现最佳的权衡。

Bipedal robots have received much attention because of the variety of motion maneuvers that they can produce, and the many applications they have in various areas including rehabilitation. One of these motion maneuvers is walking. In this study, we presented a framework for the trajectory optimization of a 5-link (planar) Biped Robot using hybrid optimization. The walking is modeled with two phases of single-stance (support) phase and the collision phase. The dynamic equations of the robot in each phase are extracted by the Lagrange method. It is assumed that the robot heel strike to the ground is full plastic. The gait is optimized with a method called hybrid optimization. The objective function of this problem is considered to be the integral of torque-squared along the trajectory, and also various constraints such as zero dynamics are satisfied without any approximation. Furthermore, in a new framework, there is presented a constraint called impact invariance, which ensures the periodicity of the time-varying trajectories. On the other hand, other constraints provide better and more human-like movement.

The importance of humanoid robots in today's world is undeniable, one of the most important features of humanoid robots is the ability to maneuver in environments such as stairs that other robots can not easily cross. A suitable algorithm to generate the path for the bipedal robot to climb is very important. In this paper, an optimization-based method to generate an optimal stairway for under-actuated bipedal robots without an ankle actuator is presented. The generated paths are based on zero and non-zero dynamics of the problem, and according to the satisfaction of the zero dynamics constraint in the problem, tracking the path is possible, in other words, the problem can be dynamically feasible. The optimization method used in the problem is a gradient-based method that has a suitable number of function evaluations for computational processing. This method can also be utilized to go down the stairs.

Adversarial training is an effective approach to make deep neural networks robust against adversarial attacks. Recently, different adversarial training defenses are proposed that not only maintain a high clean accuracy but also show significant robustness against popular and well studied adversarial attacks such as PGD. High adversarial robustness can also arise if an attack fails to find adversarial gradient directions, a phenomenon known as `gradient masking'. In this work, we analyse the effect of label smoothing on adversarial training as one of the potential causes of gradient masking. We then develop a guided mechanism to avoid local minima during attack optimization, leading to a novel attack dubbed Guided Projected Gradient Attack (G-PGA). Our attack approach is based on a `match and deceive' loss that finds optimal adversarial directions through guidance from a surrogate model. Our modified attack does not require random restarts, large number of attack iterations or search for an optimal step-size. Furthermore, our proposed G-PGA is generic, thus it can be combined with an ensemble attack strategy as we demonstrate for the case of Auto-Attack, leading to efficiency and convergence speed improvements. More than an effective attack, G-PGA can be used as a diagnostic tool to reveal elusive robustness due to gradient masking in adversarial defenses.

Objective: Despite numerous studies proposed for audio restoration in the literature, most of them focus on an isolated restoration problem such as denoising or dereverberation, ignoring other artifacts. Moreover, assuming a noisy or reverberant environment with limited number of fixed signal-to-distortion ratio (SDR) levels is a common practice. However, real-world audio is often corrupted by a blend of artifacts such as reverberation, sensor noise, and background audio mixture with varying types, severities, and duration. In this study, we propose a novel approach for blind restoration of real-world audio signals by Operational Generative Adversarial Networks (Op-GANs) with temporal and spectral objective metrics to enhance the quality of restored audio signal regardless of the type and severity of each artifact corrupting it. Methods: 1D Operational-GANs are used with generative neuron model optimized for blind restoration of any corrupted audio signal. Results: The proposed approach has been evaluated extensively over the benchmark TIMIT-RAR (speech) and GTZAN-RAR (non-speech) datasets corrupted with a random blend of artifacts each with a random severity to mimic real-world audio signals. Average SDR improvements of over 7.2 dB and 4.9 dB are achieved, respectively, which are substantial when compared with the baseline methods. Significance: This is a pioneer study in blind audio restoration with the unique capability of direct (time-domain) restoration of real-world audio whilst achieving an unprecedented level of performance for a wide SDR range and artifact types. Conclusion: 1D Op-GANs can achieve robust and computationally effective real-world audio restoration with significantly improved performance. The source codes and the generated real-world audio datasets are shared publicly with the research community in a dedicated GitHub repository1.